An Inertial Algorithm for Solving Hammerstein Equations

نویسندگان

چکیده

An inertial algorithm for solving Hammerstein equations is presented. This obtained as a consequence of new proposed and studied nonlinear involving operators that are m-accretive. Some strong convergence theorems proved in real Banach spaces uniformly smooth. Furthermore, comparisons the numerical performance our algorithms with some recent important

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Degenerate kernel approximation method for solving Hammerstein system of Fredholm integral equations of the second kind

Degenerate kernel approximation method is generalized to solve Hammerstein system of Fredholm integral equations of the second kind. This method approximates the system of integral equations by constructing degenerate kernel approximations and then the problem is reduced to the solution of a system of algebraic equations. Convergence analysis is investigated and on some test problems, the propo...

متن کامل

Legendre wavelet method for solving Hammerstein integral equations of the second kind

An ecient method, based on the Legendre wavelets, is proposed to solve thesecond kind Fredholm and Volterra integral equations of Hammerstein type.The properties of Legendre wavelet family are utilized to reduce a nonlinearintegral equation to a system of nonlinear algebraic equations, which is easilyhandled with the well-known Newton's method. Examples assuring eciencyof the method and its sup...

متن کامل

‎A matrix LSQR algorithm for solving constrained linear operator equations

In this work‎, ‎an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$‎ ‎and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$‎ ‎where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$‎, ‎$mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$‎, ‎$ma...

متن کامل

A numerical algorithm for solving a class of matrix equations

In this paper, we present a numerical algorithm for solving matrix equations $(A otimes B)X = F$  by extending the well-known Gaussian elimination for $Ax = b$. The proposed algorithm has a high computational efficiency. Two numerical examples are provided to show the effectiveness of the proposed algorithm.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2021

ISSN: ['0865-4824', '2226-1877']

DOI: https://doi.org/10.3390/sym13030376